首页> 外文OA文献 >Optimal L\'{e}vy-flight foraging in a finite landscape
【2h】

Optimal L\'{e}vy-flight foraging in a finite landscape

机译:在有限的景观中进行最佳的L \'{e} vy-flight觅食

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We present a simple model to study L\'{e}vy-flight foraging in a finitelandscape with countable targets. In our approach, foraging is a step-basedexploratory random search process with a power-law step-size distribution $P(l)\propto l^{-\mu}$. We find that, when the termination is regulated by a finitenumber of steps $N$, the optimum value of $\mu$ that maximises the foragingefficiency can vary substantially in the interval $\mu \in (1,3)$, depending onthe landscape features (landscape size and number of targets). We furtherdemonstrate that subjective returning can be another significant factor thataffects the foraging efficiency in such context. Our results suggest thatL\'{e}vy-flight foraging may arise through an interaction between theenvironmental context and the termination of exploitation, and particularlythat the number of steps can play an important role in this scenario which isoverlooked by most previous work. Our study not only provides a new perspectiveon L\'{e}vy-flight foraging, but also opens new avenues for investigating theinteraction between foraging dynamics and environment as well as offers arealistic framework for analysing animal movement patterns from empirical data.
机译:我们提出了一个简单的模型来研究具有可数目标的有限景观中的L''e e vy飞行觅食。在我们的方法中,觅食是基于阶跃的探索性随机搜索过程,具有幂律步长分布$ P(l)\ protol ^ {-\ mu} $。我们发现,当终止由有限数量的步骤$ N $调节时,最大化觅食效率的$ \ mu $的最优值可以在$ \ mu \ in(1,3)$的区间内变化很大,具体取决于景观特征(景观大小和目标数量)。我们进一步证明,在这种情况下,主观返回可能是影响觅食效率的另一个重要因素。我们的研究结果表明,高空飞行觅食可能是通过环境环境与剥削终止之间的相互作用而产生的,特别是在这种情况下,步数可以发挥重要作用,而大多数以前的工作都忽略了这一步。我们的研究不仅为“飞行”觅食提供了新的视角,而且为调查觅食动力学与环境之间的相互作用开辟了新途径,并为从经验数据分析动物运动模式提供了区域框架。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号